A Constructive Learning Algorithm for Discriminant Tangent Models

نویسندگان

  • Diego Sona
  • Alessandro Sperduti
  • Antonina Starita
چکیده

To reduce the computational complexity of classification systems using tangent distance, Hastie et al. (HSS) developed an algorithm to devise rich models for representing large subsets of the data which computes automatically the "best" associated tangent subspace. Schwenk & Milgram proposed a discriminant modular classification system (Diabolo) based on several autoassociative multilayer perceptrons which use tangent distance as error reconstruction measure. We propose a gradient based constructive learning algorithm for building a tangent subspace model with discriminant capabilities which combines several of the the advantages of both HSS and Diabolo: devised tangent models hold discriminant capabilities, space requirements are improved with respect to HSS since our algorithm is discriminant and thus it needs fewer prototype models, dimension of the tangent subspace is determined automatically by the constructive algorithm, and our algorithm is able to learn new transformations.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Discriminant Pattern Recognition Using Transformation-Invariant Neurons

To overcome the problem of invariant pattern recognition, Simard, LeCun, and Denker (1993) proposed a successful nearest-neighbor approach based on tangent distance, attaining state-of-the-art accuracy. Since this approach needs great computational and memory effort, Hastie, Simard, and Säckinger (1995) proposed an algorithm (HSS) based on singular value decomposition (SVD), for the generation ...

متن کامل

Learning Discriminant Tangent Models for Handwritten Character Recognition

Transformation invariance is known to be fundamental for excellent performances in pattern recognition. One of the most successful approach is tangent distance, originally proposed for a nearest-neighbor algorithm (Simard, LeCun and Denker, 1993). The resulting classifier, however, has a very high computational complexity and, perhaps more important, lacks discrimination capabilities. We presen...

متن کامل

Tangent Models: Comparing the TD-Neuron Constructive Algorithm versus SVD Based Algorithms

In this paper we present comparative results of our constructive algorithm versus the HSS. Specifically, we tested the HSS algorithm using both the original version based on the two-sided tangent distance, and a new version based on the one-sided tangent distance. Empirical results over the NIST-3 database show that the TD-Neuron is superior to SVD based algorithms since it reaches a better tra...

متن کامل

A New Method for Classification of Chinese Herbal Medicines Based on Local Tangent Space Alignment and LDA

Controlling the quality of Chinese herbal medicines (CHMs) is a challenging issue due to the complex and diverge specification of components in herbs. The main purpose of this study is to develop an algorithm for species identification of CHMs. An electronic nose (E-nose) was employed to collect the smell print of different groups of CHMs with different kinds and production batches. A combinati...

متن کامل

Constructive Induction on Continuous

In this paper we discuss the problem of selecting appropriate operators for constructive induction. We argue that in problems that are described, at least partially, by continuous features, discriminant analysis is a useful tool for constructive induction. This new method for constructive induction was implemented in system Ltree. Ltree is a data driven constructive induction system, able to de...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996